Galois Lattices and Bases for MGK-Valid Association Rules
نویسندگان
چکیده
We review the main properties of the quality measure MGK, which has been shown to be the normalized quality measure associated to most of the quality measures used in the data mining literature, and which enables to handle negative association rules. On the other hand, we characterize bases for MGK-valid association rules in terms of a closure operator induced by a Galois connection. Thus, these bases can be derived from a Galois lattice, as do well known bases for Confidence-valid association rules.
منابع مشابه
Incremental Construction of Alpha Lattices and Association Rules
In this paper we discuss Alpha Galois lattices (Alpha lattices for short) and the corresponding association rules. An alpha lattice is coarser than the related concept lattice and so contains fewer nodes, so fewer closed patterns, and a smaller basis of association rules. Coarseness depends on a a priori classification, i.e. a cover C of the powerset of the instance set I, and on a granularity ...
متن کاملTowards scalable divide-and-conquer methods for computing concepts and implications
Formal concept analysis (FCA) studies the partially ordered structure induced by the Galois connection of a binary relation between two sets (usually called objects and attributes), which is known as the concept lattice or the Galois lattice. Lattices and FCA constitute an appropriate framework for data mining, in particular for association rule mining, as many studies have practically shown. H...
متن کاملIncremental Maintenance of Association Rule Bases
Association rule mining from transaction databases (TDB) is a classical data mining task, whereby the most computationally intensive step is the detection of frequently occurring patterns, called frequent itemsets (FIs), from which the rules are further extracted. The number of FIs may be potentially large, leading to an even greater number of rules. Approaches based on closure operators, Galoi...
متن کاملExtraction de bases pour les règles d'association à partir des itemsets fermés fréquents
The problem of the relevance and the usefulness of extracted association rules is of primary importance because, in the majority of cases, real-life databases lead to several thousands and even millions of association rules whose confidence measure is high, and among which are many redundant rules. Using the semantic based on the closure of the Galois connection, we define two new bases for ass...
متن کاملAlpha Galois Lattices: An Overview
What we propose here is to reduce the size of Galois lattices still conserving their formal structure and exhaustivity. For that purpose we use a preliminary partition of the instance set, representing the association of a “type” to each instance. By redefining the notion of extent of a term in order to cope, to a certain degree (denoted as α), with this partition, we define a particular family...
متن کامل